Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a)) → c
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a)) → c
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:trivial
and weight map:
c=1
f_1=1
a=2